Properties of Multi-Splay Trees
نویسندگان
چکیده
Introduced a new binary search tree algorithm, cache-splay, that was the first to achieve the Unified Bound of Iacono since this problem was posed in 2001, and showed that the lower bound framework (see below) applied to a more general model of computation than binary search. Additionally, my thesis summarized my previous work on developing both lower bounds and upper bounds on the cost of sequences of accesses in the binary search tree model.
منابع مشابه
Multi-Splay Trees
In this thesis, we introduce a new binary search tree data structure called multi-splay tree and prove that multi-splay trees have most of the useful properties different binary search trees (BSTs) have. First, we demonstrate a close variant of the splay tree access lemma [ST85] for multi-splay trees, a lemma that implies multi-splay trees have the O(log n) runtime property, the static finger p...
متن کاملThesis Proposal: Multi-Splay Trees
In this thesis, we introduce multi-splay trees (MSTs) and prove several results demonstrating that MSTs have most of the useful properties different BSTs have. First, we prove a close variant of the splay tree access lemma [ST85] for multi-splay trees, a lemma that implies MSTs have the O(log n) runtime property, the static finger property, and the static optimality property. Then, we extend th...
متن کاملDynamic Optimality and Multi-Splay Trees1
The Dynamic Optimality Conjecture [ST85] states that splay trees are competitive (with a constant competitive factor) among the class of all binary search tree (BST) algorithms. Despite 20 years of research this conjecture is still unresolved. Recently Demaine et al. [DHIP04] suggested searching for alternative algorithms which have small, but non-constant competitive factors. They proposed tan...
متن کاملApplying the Interleave Bound to Splay Trees
We give a discussion of the Interleave Bound for dynamic optimal binary search, along with some new properties and results. We attempt to apply these results to Splay Trees, in the hope of working towards a proof that splay trees are O(lg lg n)-competitive. Some partial results and conjectures are formulated.
متن کاملSplay Tree
Splay trees are self-adjusting binary search trees which were invented by Sleator and Tarjan [1]. This entry provides executable and verified functional splay trees. The amortized complexity of splay trees is analyzed in the AFP entry Amortized Complexity.
متن کامل